Coupon Collecting with Quotas

نویسنده

Russell May

چکیده

We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications about computational complexity and approximation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupon Collector Problem for Non-Uniform Coupons and Random Quotas

We extend the classical coupon collector problem to find the expected number of selections needed to collect mi (possible random) copies of coupon i, when the distribution of the coupons is not necessarily equally likely. Upper and lower bounds which provide limiting asymptotics are also obtained for the expected number of selections needed to fulfill a random quota for each coupon.

متن کامل

The Coupon Subset Collection Problem

The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...

متن کامل

Coupon Collecting with or without Replacement, and with Multipurpose Coupons

The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.

متن کامل

Coupon collecting and transversals of hypergraphs

متن کامل